Random Variables, Distributions, and Expected Value

ثبت نشده
چکیده

1. A random variable is a variable that takes specific values with specific probabilities. It can be thought of as a variable whose value depends on the outcome of an uncertain event. 2. We usually denote random variables by capital letters near the end of the alphabet; e.g., X,Y,Z. 3. Example: Let X be the outcome of the roll of a die. Then X is a random variable. Its possible values are 1, 2, 3, 4, 5, and 6; each of these possible values has probability 1/6. 4. The word “random” in the term “random variable” does not necessarily imply that the outcome is completely random in the sense that all values are equally likely. Some values may be more likely than others; “random” simply means that the value is uncertain. 5. When you think of a random variable, immediately ask yourself • What are the possible values? • What are their probabilities? 6. Example: Let Y be the sum of two dice rolls. • Possible values: {2, 3, 4, . . . , 12}. • Their probabilities: 2 has probability 1/36, 3 has probability 2/36, 4 has probability 3/36, etc. (The important point here is not the probabilities themselves, but rather the fact that such a probability can be assigned to each possible value.) 7. The probabilities assigned to the possible values of a random variable are its distribution. A distribution completely describes a random variable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expected Duration of Dynamic Markov PERT Networks

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

متن کامل

A Fuzzy Random Minimum Cost Network Flow Programming Problem

In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...

متن کامل

Distributions of the Ratios of Independent Kumaraswamy Variables and System Reliability Applications

‎In this article‎, ‎first of all‎, ‎the Kumaraswamy distribution is introduced‎. ‎Then‎, ‎the joint and marginal distributions of W = X1/X2 and T = X1/X1+X2 where X1 and X2 are independent Kumaraswamy random variables‎, ‎are obtained and the moments of these random variables are computed‎. ‎The distribution of random variables  W  and T  can be used in reliability studies and statistical models...

متن کامل

SOME RESULTS OF MOMENTS OF UNCERTAIN RANDOM VARIABLES

Chance theory is a mathematical methodology for dealing with indeterminatephenomena including uncertainty and randomness.Consequently, uncertain random variable is developed to describe the phenomena which involveuncertainty and randomness.Thus, uncertain random variable is a fundamental concept in chance theory.This paper provides some practical quantities to describe uncertain random variable...

متن کامل

Uncertain random programming with applications

Uncertain random variable is a tool to deal with a mixture of uncertainty and randomness. This paper presents an operational law of uncertain random variables, and shows an expected value formula by using probability and uncertainty distributions. This paper also provides a framework of uncertain random programming that is a type of mathematical programming involving uncertain random variables....

متن کامل

Combinatorial Multi-Armed Bandit with General Reward Functions

In this paper, we study the stochastic combinatorial multi-armed bandit (CMAB) framework that allows a general nonlinear reward function, whose expected value may not depend only on the means of the input random variables but possibly on the entire distributions of these variables. Our framework enables a much larger class of reward functions such as the max() function and nonlinear utility fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001